A decoding algorithm for 2D convolutional codes over the erasure channel
نویسندگان
چکیده
Two-dimensional (2D) convolutional codes are a generalization of (1D) codes, which suitable for transmission over an erasure channel. In this paper, we present decoding algorithm 2D such channel by reducing the process to several steps applied 1D codes. Moreover, provide constructions that specially tailored our algorithm.
منابع مشابه
Decoding of 2D convolutional codes over an erasure channel
In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main idea is to reduce the decoding problem of 2D convolutional codes to a problem of decoding a set of associate...
متن کاملExact probability of erasure and a decoding algorithm for convolutional codes on the binary erasure channel
Analytic expressions for the exact probability of erasure for systematic, rate-1/2 convolutional codes used to communicate over the binary erasure channel and decoded using the soft-input, soft-output (SISO) and a posteriori probability (APP) algorithms are given. An alternative forward-backward algorithm which produces the same result as the SISO algorithm is also given. This low-complexity im...
متن کاملAn Algebraic Decoding Algorithm for Convolutional Codes
The class of convolutional codes generalizes the class of linear block codes in a natural way. The construction of convolutional codes which have a large free distance and which come with an e cient decoding algorithm is a major task. Contrary to the situation of linear block codes there exists only very few algebraic construction of convolutional codes. It is the purpose of this article to int...
متن کاملOn Optimal Erasure and List Decoding Schemes of Convolutional Codes
A modified Viterbi algorithm with erasures and list-decoding is introduced. This algorithm is shown to yield the optimal decoding rule of Forney with erasures and variable list-size. For the case of decoding with erasures, the optimal algorithm is compared to the simple algorithm of Yamamoto and Itoh. The comparison shows a remarkable similarity in simulated performance, but with a considerably...
متن کاملAdaptive Decoding Algorithms for Low-Density Parity-Check Codes over the Binary Erasure Channel
Two decoding procedures combined with a beliefpropagation (BP) decoding algorithm for low-density parity-check codes over the binary erasure channel are presented. These algorithms continue a decoding procedure after the BP decoding algorithm terminates. We derive a condition that our decoding algorithms can correct an erased bit which is uncorrectable by the BP decoding algorithm. We show by s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2023
ISSN: ['1930-5346', '1930-5338']
DOI: https://doi.org/10.3934/amc.2021031